minimal tree
英 [ˈmɪnɪməl triː]
美 [ˈmɪnɪməl triː]
网络 最小树; 最小生成树
双语例句
- In minimal attack tree phase, by removing invalid branches and checking whether a minimal attack tree still exists, a customized minimal attack tree is generated.
最小攻击树阶段：剔除无用分支，判断其存在性后生成最小攻击树； - The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO.
求解最小生成树的方法虽然很多，但是利用LINGO建立相应的整数规划模型是一种新的尝试。 - A 2-D minimal spanning tree model on the spatial structures of natural focal disease
自然疫源性疾病疫源地空间结构的二维最小生成树模型及其应用 - Image edge detection using new weighted entropy minimal spanning tree algorithm
最小加权熵支撑树图像边缘提取方法 - A Minimal Spanning Tree based Graph Indexing Algorithm
基于最小生成树的图数据库索引算法 - A color image segmentation method based on Minimal Spanning Tree and local thresholds;
提出一种采用彩色分割及多级混合集成分类器的车牌自动识别方法。 - The ecological relationships of weeds in early rice fields in this area were also analyzed by the minimal tree method of cluster analysis and polar ordination.
以生态位重叠值为指标，用极点排序和聚类分析中的最小生成树法，直观地表示了该地区早稻田主要杂草的种间生态学相似关系。 - The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.
对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。 - At the same time, two new algorithms which are lustful algorithm and the method of modifying the minimal spanning tree are presented.
并提出两个新的算法&贪心算法和修改最小生成树法。 - With the support of GIS, the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipeline's layout optimization.
首次提出了将GIS（地理信息系统）和图论技术应用于低压管道输水灌溉规划设计及灌溉管网优化中，在GIS支持环境下，应用图论中的最小生成树法和120°规划进行管道的最优化布置。 - A note on minimal spanning tree problem
关于最小生成树问题的注记 - Minimal Spanning Tree Model by Integer Programming
整数规划下的最小生成树模型 - A New Algorithm of Minimal Spanning Tree
最小支撑树的新算法 - An Algorithm to Produce Minimal Tree with Distance-Matrix
产生最小树的距离矩阵算法 - Algorithm and Analysis of Fuzzy Minimal Spanning Tree in Fluid Pipeline Networks
流体管网中模糊最小树的算法与分析 - Application of Minimal Spanning Tree in Supplies of Central Heating
最小生成树问题在暖气供应建设中的应用 - This paper extends the heuristic algorithm for network design from one dimensional space into two dimensional space, taking minimal spanning tree as initial network, thus suggesting a heuristic algorithm which can be used efficiently for centralized network design on time delay constraint.
本文把网络设计的试探算法从一维空间扩展到二维空间，用最小生成树作为起始网，提出了一种便于以时延为约束条件的网络设计试探算法。 - In the procedure of optimization, first, Steiner minimal tree is found using SI algorithm, which is used as the initial layout of the systems;
在优化过程中，首先，用SI算法求出系统Steiner的最短树，作为其初始布局； - It can be simulated as finding a minimal cost tree that contains designed source and multiple destination nods so that certain constraints in a given communication network are satisfied.
该问题可被模拟为找一棵包含特定源和多个目的地的最小代价生成树，使得在一个给定的通信网络中的特定约束被满足。 - The article introduces prim algorithm of minimal spanning tree, the realization of minimum function and the influence which the function makes upon minimal spanning tree gotten by prim algorithm.
本文介绍了最小生成树的prim算法，minimum函数的实现过程及该函数对由prim算法所得到的最小生成树的影响。 - Taking into account many restrict condition, found the math model of planning, design of the heuristic optimize method which was based on the minimal tree.
在考虑各种约束条件的情况下，建立的优化规划模型，设计了基于最小生成树的启发式网架优化搜索方法。 - A question about minimal spanning tree
最小生成树的一个问题 - This paper presents a novel insider threat model. Based on the encapsulated user intent, the customized minimal attack tree can be generated.
文中提出了一个新颖的InsiderThreat模型，依据用户使用意图的封装，定制生成该用户的最小攻击树。 - Prim algorithm of minimal spanning tree and minimum function
最小生成树的prim算法及minimum函数 - As far as the minimal spanning tree problem for the digraph with asymmetric weights is concerned, an explicit integer programming model is proposed, which could be solved successfully by using the integer programming packages such as Lindo.
就具有不对称权重的有向图中的最小生成树问题，本文首次建立了相应的显式整数规划模型，这一模型可以成功地运用整数规划软件包如Lindo等求解。 - Calculate the minimal spanning tree, which passes the points in dimensions space;
按图论原理求过m维空间n个点的最小生成树； - In this article, with the aid of a ranking method of fuzzy numbers, algorithms of fuzzy minimal spanning tree are obtained by applying fuzzy set to analysis of pipeline networks.
目的将模糊集应用到管网分析中，研究流体管网中模糊最小树的算法。 - The algorithm of o ( n~ 2) minimal spanning tree and its application in ventilation networks
通风网络中最小生成树的O（n~2）算法 - The method firstly prunes the training set. Then it builds Steiner minimal tree covering model on the retained typical samples.
该算法首先对目标类训练集进行样本修剪，然后对保留的典型样本构建Steiner最小树覆盖模型。 - Because traditional method are suitable to process bulbiform data, but minimal spanning tree clustering is good at process data which have complex graphic border.
由于传统的聚类方法，只适合处理球状数据，而最小生成树聚类算法对图形边界较复杂的数据也能得到较好的结果。